A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time
نویسندگان
چکیده
منابع مشابه
An Algebraic Approach to Local Observability at an Initial State for Discrete-Time Polynomial Systems
In this paper, we consider local observability at an initial state for discrete-time autonomous polynomial systems. When testing for observability, for discrete-time nonlinear systems, a condition based on the inverse function theorem is commonly used. However, it is a sufficient condition. In this paper, first we derive a necessary and sufficient condition for global observability at an initia...
متن کاملProbabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
Let f, f1, . . . , fs be n-variate polynomials with rational coefficients of maximum degree D and let V be the set of common complex solutions of F = (f1, . . . , fs). We give an algorithm which, up to some regularity assumptions on F, computes an exact representation of the global infimum f? of the restriction of the map x → f (x) to V ∩ Rn, i.e. a univariate polynomial vanishing at f? and an ...
متن کاملLocal Maxima of a Random Algebraic Polynomial
We present a useful formula for the expected number of maxima of a normal process ξ(t) that occur below a levelu. In the derivation we assume chiefly that ξ(t), ξ(t), and ξ(t) have, with probability one, continuous 1 dimensional distributions and expected values of zero. The formula referred to above is then used to find the expected number of maxima below the level u for the random algebraic p...
متن کاملA Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks
Many complex systems in biology, physics, and engineering include a large number of state-variables, and measuring the full state of the system is often impossible. Typically, a set of sensors is used to measure part of the state-variables. A system is called observable if these measurements allow to reconstruct the entire state of the system. When the system is not observable, an important and...
متن کاملA Polynomial Time Algorithm for Local Testability and its Level
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set of generators for S are equal in the semigroup if (1) the pre x and su x of the words of length k coincide, and (2) the set of intermediate substrings of length k of the words coincide. The local testability problem fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0532